Congruence semimodular varieties II: Regular varieties

نویسنده

  • P. AGLIANO
چکیده

In [8], P. Jones characterized the regular varieties of semigroups which are congruence semimodular and he partially solved the problem of characterizing the non-regular, congruence semimodular (CSM) varieties of semigroups. For regular varieties his characterization was an equational one, so necessarily a part of his argument was semigroup-theoretic. But some of his argument involved only congruence lattice manipulations and references to the two-element semilattice. It seemed plausible that one could give a universal algebraic characterization of all regular, CSM varieties. Jones posed the problem of characterizing regular, CSM varieties at the International Conference on Universal Algebra and Lattice Theory held at Molokai, Hawaii in 1987. The authors were students attending that conference and became familiar with the problem. Agliano began a general investigation of CSM varieties under the supervision of his doctoral advisor, J. B. Nation, at the University of Hawaii. In the fall of 1988, Agtiano filed his dissertation and Kearnes arrived at the University of Hawaii. We began discussing whether or not tame congruence theory could be applied to solve Jones' problem, at least for locally finite varieties or pseudo-varieties of finite algebras. This is the approach that had been suggested by Jones in 1987. We discovered a number of interesting facts about CSM varieties using tame congruence theory, but we did not solve Jones' problem at that time. (These "interesting facts" have since been collected in, Congruence semimodular varieties I: locally finite varieties.) After about two months our collaboration ended when Agliano returned to Italy. For a while we felt compelled to publish some of our results on CSM varieties, but we were reluctant to do so without solving Jones' problem first. We renewed

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Congruence semimodular varieties I: Locally finite varieties

The lattice of closed subsets of a set under such a closure operator is semimodular. Perhaps the best known example of a closure operator satisfying the exchange principle is the closure operator on a vector space W where for X ___ W we let C(X) equal the span of X. The lattice of C-closed subsets of W is isomorphic to Con(W) in a natural way; indeed, if Y _~ W x W and Cg(Y) denotes the congrue...

متن کامل

Canonical Varieties of Completely Regular Semigroups

Completely regular semigroups CR are regarded here as algebras with multiplication and the unary operation of inversion. Their lattice of varieties is denoted by L.CR/. Let B denote the variety of bands and L.B/ the lattice of its subvarieties. The mapping V → V ∩ B is a complete homomorphism of L.CR/ onto L.B/. The congruence induced by it has classes that are intervals, say VB = [VB ;V B] for...

متن کامل

M-Solid Varieties of Languages

In this paper, a characterization of the language varieties and congruence varieties corresponding toM -solid pseudovarieties is presented. Taking into account the isomorphisms of the Eilenberg-type correspondences, each complete sublattice of pseudovarieties corresponds to a complete sublattice of language varieties, as well as another one of congruence varieties. For the varieties of tree lan...

متن کامل

-Solid Varieties of Languages

In this paper, a characterization of the language varieties and congruence varieties corresponding to M -solid pseudovarieties is presented. Taking into account the isomorphisms of the Eilenberg-type correspondences, each complete sublattice of pseudovarieties corresponds to a complete sublattice of language varieties, as well as another one of congruence varieties. For the varieties of tree la...

متن کامل

IDEMPOTENT n-PERMUTABLE VARIETIES

One of the important classes of varieties identified in tame congruence theory is the class of varieties which are n-permutable for some n. In this paper we prove two results: (1) For every n > 1 there is a polynomial-time algorithm which, given a finite idempotent algebra A in a finite language, determines whether the variety generated by A is n-permutable; (2) A variety is n-permutable for so...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005